Optimization on Shortest Path Finding for Underground Cable Transmission Lines Routing Using Gis
نویسنده
چکیده
In cable trench construction, one of the tasks for engineers is to select a suitable route to minimize construction cost and obstructions. This paper discusses the development of a Geographic Information Systems (GIS)-based Customized system to automate the process of optimum shortest path finding for routing of underground power supply cable between any two substations. It combines the spatial analysis capabilities of GIS with the sophistication of one of the Artificial Intelligence technique “Simple Ant Colony Optimization” to deal with the complexity inherent in optimum shortest path finding. The results of this project are validated and compared with an inbuilt tool Network analyst of GIS software ArcGIS and explained in the Result and discussion of this paper. In this project only optimum shortest path finding is aimed and this will be one of the main input data in my future work of improving distribution efficiency using GIS.
منابع مشابه
Geospatial Network Analysis Using Particle Swarm Optimization
The shortest path (SP) problem concerns with finding the shortest path from a specific origin to a specified destination in a given network while minimizing the total cost associated with the path. This problem has widespread applications. Important applications of the SP problem include vehicle routing in transportation systems particularly in the field of in-vehicle Route Guidance System (RGS...
متن کاملTransmission Corridor Location: Multi-Path Alternative Generation Using the K-Shortest Path Method
The corridor location problem for determining good route alternatives for developing new infrastructure often requires generating many viable alternatives which may be later evaluated in public discourse. One method for generating large sets of least cost paths is by solving the kshortest path problem on a terrain network, but its usage in the literature on finding route alternatives has been l...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملImprovement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm
Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...
متن کاملImprovement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm
Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...
متن کامل